Set-weighted games and their application to the cover problem

The cover of a transport, social, or communication network is computationally complex problem. To deal with it, this paper introduces special class simple games in which the set minimal winning coalitions coincides least covers. A distinctive feature such game that it has weighted form, weights and quota are sets rather than real numbers. This termed set-weighted games. real-life large number covers, therefore develops methods for analyzing form taken into account. necessary sufficient conditions to be were found. vertex (Gusev, 2020) was shown belong class, its proven closed under operations union intersection, not case sample object transport district Petrozavodsk, Russia. method suggested efficiently deploying surveillance cameras at crossroads so all covers